An algorithmic view of pseudochaos
نویسنده
چکیده
The controversial concept of quantum chaos – the dynamical chaos in bounded mesoscopic quantum systems – is presented as the most important and universal instance of a new generic dynamical phenomenon: pseudochaos. The latter characterizes the irregular behaviour of dynamical systems with discrete energy and/or frequency spectrum, which include classical systems with discrete phase space. The question of randomness is addressed in terms of the algorithmic theory of dynamical systems, using the Arnold cat map for illustration. The relationship between the algorithmic theory and ergodic theory is discussed. ©1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
Probabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملPSEUDOCHAOS G . M . Zaslavsky
A family of the billiard-type systems with zero Lyapunov exponent is considered as an example of dynamics which is between the regular one and chaotic mixing. This type of dynamics is called “pseudochaos”. We demonstrate how the fractional kinetic equation can be introduced for the pseudochaos and how the main critical exponents of the fractional kinetics can be evaluated from the dynamics. Pro...
متن کاملPseudochaos in Statistical Physics
A new generic dynamical phenomenon of pseudochaos and its relevance to the statistical physics both modern as well as traditional one are considered and explained in some detail. The pseudochaos is defined as a statistical behavior of the dynamical system with discrete energy and/or frequency spectrum. In turn, the statistical behavior is understood as time–reversible but nonrecurrent relaxatio...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کامل